Finite and In nite QBD Chains : A Simple and UnifyingAlgorithmic

نویسنده

  • Khosrow Sohraby
چکیده

In this paper, we present a novel algorithmic approach , the hybrid matrix geometric/invariant subspace method, for nding the stationary probability distribution of the nite QBD process which arises in performance analysis of computer and communication systems. Assuming that the QBD state space is deened in two dimensions with m phases and K + 1 levels , the solution vector for level k, k ; 0 k K is shown to be in a modiied matrix geometric form where R 1 and R 2 are certain solutions to two nonlinear matrix equations and v 1 and v 2 are vectors to be determined using the boundary conditions. We show that the matrix geometric factors R 1 and R 2 can simultaneously be obtained independently of K via nding the sign function of a real matrix by an iterative algorithm with quadratic convergence rates. The time complexity of obtaining the coeecient vectors v 1 and v 2 is shown to be O(m 3 log 2 K) which indicates that the contribution of the number of levels on the overall algorithm is minimal. Besides the numerical ef-ciency, the proposed method is numerically stable and in the limiting case of K ! 1, it is shown to yield the well-known matrix geometric solution k = 0 R k 1 for innnite QBD chain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite and In nite QBD Chains : A Simple

In this paper, we present a novel algorithmic approach , the hybrid matrix geometric/invariant subspace method, for nding the stationary probability distribution of the nite QBD process which arises in performance analysis of computer and communication systems. Assuming that the QBD state space is deened in two dimensions with m phases and K + 1 levels , the solution vector for level k, k ; 0 k...

متن کامل

CLASSIFYING FUZZY SUBGROUPS OF FINITE NONABELIAN GROUPS

In this paper a rst step in classifying the fuzzy subgroups of a nite nonabelian group is made. We develop a general method to count the number of distinct fuzzy subgroups of such groups. Explicit formulas are obtained in the particular case of dihedral groups.

متن کامل

Folding algorithm: a computational method for finite QBD processes with level-dependent transitions

This paper presents a new computational method for steady state analysis of nite QBD-process with level-dependent transitions. The QBD state space is deened in two-dimension with N phases and K levels. Instead of formulating solutions in matrix-geometric form, the Folding-algorithm provides a technique for direct computation of P = 0, where P is the QBD generator which is an (NK)(NK) matrix. Ta...

متن کامل

On the Graphs Related to Green Relations of Finite Semigroups

In this paper we develop an analog of the notion of the con- jugacy graph of  nite groups for the  nite semigroups by considering the Green relations of a  nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a  nite semigroup S , we  first atte...

متن کامل

MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES

In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997